Projected cooling algorithm for quantum computation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem.  At each step of ALS algorithms two convex least square problems should be solved, which causes high com...

متن کامل

Efficient Algorithm for Projected Clustering

With high dimensional data, natural clusters are expected to exist in different subspaces. We propose the EPC (Efficient Projected Clustering) algorithm to discover the sets of correlated dimensions and the location of the clusters. This algorithm is quite different from previous approaches and has the following advantages: (1) no requirement of the input of the number of natural clusters, and ...

متن کامل

Quantum Computation and Shor's Factoring Algorithm

The eld of quantum computation studies the power of computers that are based on quantum-mechanical principles. We give a brief introduction to the model of quantum computation and to its main success so far: Peter Shor's eecient quantum algorithm for factoring integers.

متن کامل

Quantum computation and Shor’s factoring algorithm

Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates ...

متن کامل

a projected alternating least square approach for computation of nonnegative matrix factorization

nonnegative matrix factorization (nmf) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. methods in alternating least square (als) approach usually used to solve this non-convex minimization problem.  at each step of als algorithms two convex least square problems should be solved, which causes high com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Letters B

سال: 2020

ISSN: 0370-2693

DOI: 10.1016/j.physletb.2020.135536